Theory of computation

Results: 2087



#Item
491Turing machine / Theory of computation / Alan Turing / Computability theory / Turing completeness / Actor model / Algorithm / Complexity / Strong AI / Computer science / Theoretical computer science / Applied mathematics

PDF Document

Add to Reading List

Source URL: www.cs.bham.ac.uk

Language: English - Date: 2014-08-13 20:55:06
492Structural complexity theory / Complexity classes / Models of computation / Lance Fortnow / Probabilistic complexity theory / Interactive proof system / IP / Bounded-error probabilistic polynomial / Probabilistic Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics

Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139

Add to Reading List

Source URL: people.cs.uchicago.edu

Language: English - Date: 2010-05-13 09:33:41
493Computer science / Formal methods / Deterministic finite automaton / Nondeterministic finite automaton / Finite-state machine / X-machine / Non-deterministic Turing machine / Ω-automaton / Finite state transducer / Models of computation / Automata theory / Theoretical computer science

Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisa

Add to Reading List

Source URL: pauillac.inria.fr

Language: English - Date: 2008-12-14 19:37:35
494Mathematics / Theory of computation / Futurologists / Marshall McLuhan / New Criticism / Postmodernism / Rudy Rucker / The Hive / Algorithm / Theoretical computer science / Applied mathematics / Computability theory

The Past and Future History of Gnarly Computation

Add to Reading List

Source URL: www.rudyrucker.com

Language: English - Date: 2005-07-18 19:13:18
495Finite-state machine / Computing / Mathematics / Deterministic pushdown automaton / Automata theory / Models of computation / Nondeterministic finite automaton

On system rollback and totalised fields An algebraic approach to system change Mark Burgess and Alva Couch 20th June 2011 This paper is dedicated to Jan Bergstra on the occasion of his 60th birthday.

Add to Reading List

Source URL: markburgess.org

Language: English - Date: 2014-12-18 08:35:34
496Verification / Finite-state machine / Models of computation / Automata theory / Systems engineering

Research internship (Master M2) Title Verification of concurrent systems with data structures Description

Add to Reading List

Source URL: www.lsv.ens-cachan.fr

Language: English - Date: 2013-11-20 05:22:25
497Theoretical computer science / Omega language / Theory of computation / Determinacy / Infinite loop / Constructible universe / Ordinal number / Formal languages / Computer programming / Mathematics

Languages vs. ω-Languages in Regular Infinite Games Namit Chaturvedi, Jörg Olschewski, Wolfgang Thomas DLT 2011, Milano July 19, 2011

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-05-29 10:56:44
498Recurrence relation / Theory of computation / Logarithm / Constructible universe / Series / Methods of computing square roots / Mathematics / Algebra / Root-finding algorithms

Arithmetica Logarithmica 8-1 Synopsis: Chapter Eight.

Add to Reading List

Source URL: www.17centurymaths.com

Language: English - Date: 2006-09-04 00:40:13
499Models of computation / Theoretical computer science / Functions and mappings / Calculus / Ω-automaton / Finite state transducer / Continuous function / Derivative / Computability / Automata theory / Mathematics / Mathematical analysis

Regular Real Analysis Swarat Chaudhuri Rice University Sriram Sankaranarayanan

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2013-04-26 17:57:31
500Mathematical logic / Computable function / Computable number / Computable analysis / Computable real function / Specker sequence / Enumeration / Computability / Numbering / Computability theory / Theory of computation / Theoretical computer science

Preface Computable analysis is a branch of computability theory studying those functions on the real numbers and related sets which can be computed by machines such as digital computers. The increasing demand for reliab

Add to Reading List

Source URL: www.fernuni-hagen.de

Language: English - Date: 2009-09-05 02:34:00
UPDATE